Traffic Grooming Optimization in Mesh Wdm Networks without Wavelength Converter

نویسندگان

  • James Yiming Zhang
  • Jing Wu
  • Oliver Yang
  • Michel Savoie
  • J. Zhang
  • J. Wu
  • O. Yang
چکیده

This is a tutorial paper on the traffic grooming optimization in mesh Wavelength Division Multiplexing (WDM) networks for static traffic patterns. The traffic grooming technique provides a two-layer traffic engineering capability by aggregating and routing low-bandwidth traffic flows from the upper layer over re-configurable highbandwidth connections in the lower layer. This paper demonstrates how to use the Lagrangian Relaxation and Subgradient Methods (LRSM) to solve the optimization problem over a mesh WDM network where no wavelength converters are used, i.e., a lightpath must use the same wavelength from its source to destination. The framework makes use of a constrained Integer Linear Programming (ILP) formulation. The outputs of our optimization include the selection of profitable traffic flows, the routing schemes for the selected traffic flows over lightpaths, the selection of lightpaths, and the Routing and Wavelength Assignment (RWA) schemes for the selected lightpaths. Some interesting observations are noted.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Dynamic Traffic Grooming Algorithm in Multi-granularity Heterogeneous Optical WDM Mesh Networks

We consider the problem of traffic grooming in wavelength division multiplexing networks. Our objective is to minimize the required number of electronic add-drop multiplexers. We investigate the problem of efficiently provisioning connections of different bandwidth granularities in a heterogeneous WDM mesh network through dynamic traffic grooming schemes under traffic engineering principles. We...

متن کامل

Dynamic Traffic Grooming using Fixed-Alternate Routing in WDM Mesh Optical Networks

There is a mismatch between lightpath channel capacity and traffic request capacity in wavelength division multiplexed (WDM) optical mesh networks. Traffic grooming is needed to resolve this mismatch in an efficient way. We study the dynamic traffic grooming problem in WDM mesh networks using the fixed-alternate routing (FAR) approach. Based on the FAR approach, we propose the fixed-order groom...

متن کامل

Network profit optimization for traffic grooming in WDM networks with wavelength converters

The traffic grooming technique provides a two-layer traffic engineering capability by aggregating and routing up-layer low-bandwidth traffic flows over low-layer re-configurable routed high-bandwidth connections. In this paper, we optimize traffic grooming for static traffic in mesh Wavelength Division Multiplexing (WDM) networks with wavelength converters. The optimization objective is to maxi...

متن کامل

School of Computer Science Literature Review and Survey (0360-510, Fall 2006) Heuristics for Traffic Grooming in WDM Optical Networks with Shared Path Protection

The emergence of wavelength division multiplexing (WDM) technology has significantly increased the transmission capacity of a link in today's optical networks. In WDM networks, the bandwidth request of a traffic stream is usually much lower than the capacity of a wavelength. Traffic grooming can aggregate low-rate connections onto high-capacity optical fibers to make an efficient use of the ban...

متن کامل

Dynamic Multicast Traffic Grooming in WDM Networks with Reconfigurable Light-trees

We address the traffic grooming problem in WDM mesh networks with dynamic multicast traffic. We develop a grooming algorithm in which light-trees can dynamically be reconfigured when a new route is established. c © 2004 Optical Society of America OCIS codes: (060.4250) Networks

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008